High-order finite element – linearly implicit two-step peer methods for time-dependent PDEs

Linearly-implicit two-step peer methods are successfully applied in the numerical solution of ordinary differential and differential-algebraic equations. One of their strengths is that even highorder methods do not show order reduction in computations for stiff problems. With this property, peer methods commend themselves as time-stepping schemes in finite element calculations for timedependent partial differential equations (PDEs). We have included a class of linearly-implicit two-step peer methods in the finite element software KARDOS. There PDEs are solved following the Rothe method, i.e. first discretised in time, leading to linear elliptic problems in each stage of the peer method. We describe the construction of the methods and how they fit into the finite element framework. We also discuss the starting procedure of the two-step scheme and questions of local temporal error control. The implementation is tested for two-step peer methods of orders three to five on a selection of PDE test problems on fixed spatial grids. No order reduction is observed and the two-step methods are more efficient, at least competitive, in comparison with the linearly implicit one-step methods provided in KARDOS. Mathematics Subject Classification 2000: 65M20, 65M60, 65L06